On k-Guarding of Polygons
نویسندگان
چکیده
A polygon is called k-guardable if it is possible to find a collection G of points in the interior of the edges of P such that every point in P is visible from at least k elements of G, and such that no edge of P contains more than one element of G. In this paper we prove that every simple polygon can be 1-guarded using at most n/2 guards, and that every polygon with 0 or 1 polygonal hole can be 2-guarded. We also prove that even though every polygon with holes is 1-guardable, for every h ≥ 2 there exists a polygon with h holes that is not 2-guardable. Our proofs lead to linear time algorithms to find 1and 2-guarding collections for polygons with 0 or 1 hole.
منابع مشابه
On Guarding Orthogonal Polygons with Bounded Treewidth
There exist many variants of guarding an orthogonal polygon in an orthogonal fashion: sometimes a guard can see an entire rectangle, or along a staircase, or along a orthogonal path with at most k bends. In this paper, we study all these guarding models in the special case of orthogonal polygons that have bounded treewidth in some sense. Exploiting algorithms for graphs of bounded treewidth, we...
متن کاملOn r-Guarding Thin Orthogonal Polygons
Guarding a polygon with few guards is an old and well-studied problem in computational geometry. Here we consider the following variant: We assume that the polygon is orthogonal and thin in some sense, and we consider a point p to guard a point q if and only if the minimum axis-aligned rectangle spanned by p and q is inside the polygon. A simple proof shows that this problem is NP-hard on ortho...
متن کاملAltitude Terrain Guarding and Guarding Uni-Monotone Polygons
We show that the problem of guarding an x-monotone terrain from an altitude line and the problem of guarding a uni-monotone polygon are equivalent. We present a polynomial time algorithm for both problems, and show that the cardinality of a minimum guard set and the cardinality of a maximum witness set coincide. Thus, uni-monotone polygons are perfect; this result also extends to monotone mount...
متن کاملOn k-Guarding Polygons
We describe a polynomial time O(k log log OPTk(P ))approximation algorithm for the k-guarding problem of finding a minimum number, OPTk(P ), of vertex guards of an n-vertex simple polygon P so that for every point p ∈ P , the number of guards that see p is at least the minimum of k and the number of vertices that see p. Our approach finds O ( k ε log log 1 ε ) size (k, ε)-nets for instances of ...
متن کاملTriangulating and Guarding Realistic Polygons
We propose a new model of realistic input: k-guardable objects. An object is k-guardable if its boundary can be seen by k guards in the interior of the object. In this abstract, we describe a simple algorithm for triangulating k-guardable polygons. Our algorithm, which is easily implementable, takes linear time assuming that k is constant.
متن کامل